Automated theorem proving

Results: 768



#Item
11Theoretical computer science / Logic / Mathematical logic / Automated theorem proving / Logic programming / Logical truth / Propositional calculus / Substitution / Nqthm / Rewrite order / Symbol

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Proving Termination by Dependency Pairs and Inductive Theorem Proving Carsten Fuhs · J¨

Add to Reading List

Source URL: www.dcs.bbk.ac.uk

Language: English - Date: 2011-06-16 09:07:59
12Software engineering / Software / Proof assistants / Theoretical computer science / Functional languages / Automated theorem proving / Logic in computer science / Nunchaku / Isabelle / HOL / Coq / Kepler conjecture

Engineering Nunchaku: A Modular Pipeline of Codecs Simon Cruanes 28th of June, 2016 Simon Cruanes

Add to Reading List

Source URL: cedeela.fr

Language: English - Date: 2016-06-28 05:58:53
13Epistemology / Philosophy / Logic / Automated theorem proving / Computational complexity theory / Critical thinking / Logical truth / Proof / Genealogy / Mathematical proof / Divorce / Maiden and married names

Fairfield County Lineage Society Application Guidelines and Checklist GENERAL INFORMATION Miscellaneous Information: 1. All applications and supporting documents become the property of FCC-OGS. 2. By submitting an applic

Add to Reading List

Source URL: www.fairfieldgenealogy.org

Language: English - Date: 2014-01-19 16:16:57
14Logic / Mathematical logic / Mathematics / Automated theorem proving / Propositional calculus / Rules of inference / Resolution / Boolean algebra / Literal / First-order logic / SLD resolution / Horn clause

Part 2: First-Order Logic 2.1 Syntax 2.2 Semantics 2.3 Models, Validity, Satisfiability 2.4 Algorithmic problems 2.5 Normal forms and Skolemization

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2009-06-05 11:15:41
15Logic / Mathematical logic / Mathematics / Propositional calculus / Automated theorem proving / Boolean algebra / Syntax / Boolean satisfiability problem / Clause / Valuation / Propositional variable / Unit propagation

Microsoft PowerPoint - perspCompatibility Mode]

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2012-12-18 03:41:56
16Software engineering / Theoretical computer science / Automated theorem proving / Mathematics / Logic in computer science / Functional languages / Formal methods / Reasoning / Satisfiability modulo theories / Rippling / Automated reasoning / IP

TIP: Tons of Inductive Problems Koen Claessen, Moa Johansson, Dan Ros´en, and Nicholas Smallbone Department of Computer Science and Engineering, Chalmers University of Technology {koen,jomoa,danr,nicsma}@chalmers.se Ab

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2015-05-06 07:44:21
17Logic / Mathematical logic / Abstraction / Non-classical logic / Modal logic / Automated theorem proving / Logic programming / Model theory / Admissible rule / Substitution / Unification / Intermediate logic

A syntactic approach to unification in transitive reflexive modal logics Rosalie Iemhoff∗ June 10, 2016 Abstract

Add to Reading List

Source URL: www.phil.uu.nl

Language: English - Date: 2016-06-10 10:39:23
18Theoretical computer science / Mathematical logic / Logic / Formal methods / Logic in computer science / Process calculi / -calculus / Automated theorem proving / Process calculus / Lambda calculus / Bisimulation / Limit of a function

to appear in TCS – www.wischik.com/lu/research/explicit-fusions.html Explicit Fusions Lucian Wischik1 and Philippa Gardner2 1 2

Add to Reading List

Source URL: www.wischik.com

Language: English - Date: 2004-02-23 13:34:35
19Theoretical computer science / Logic / Mathematics / Automated theorem proving / Logic programming / Logical truth / Propositional calculus / Substitution / Lambda calculus / Term / Relationships among probability distributions / Centripetal CatmullRom spline

Chapter 2 Untyped Lambda Calculus We assume the existence of a denumerable set VAR of (object) variables x0 , x1 , x2 , . . ., and use x, y, z to range over these variables. Given two variables x1 and x2 , we write x1 =

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2009-12-10 13:51:51
UPDATE